This is a set of real instances of School Transport problem in the Province of Burgos, Spain. 

The dates were reported by "Direccin Provincial de Educacin" in 1999.


 
There are 42 centres of "primary" education and 16 centres of secundary (similar to hight schools). So that there are 42 + 16 instances. In the papers was used the instances centres of secundary.
 
The are two files named: destinobu1.dat and destinobu2.dat with the names of the centres.
 
For each instance ("primary" o "secundary") there are 4 files:
 
- --.cor: UTM coordenates (x,y) of points: the first one is correponding to the centre or school, the rest are relative to the points in where we have to pick-up children.
- --.dat: The second number of every row is the number of children that we have to pick-up.
- --.dis: Distance matrix (in Hectometres), between the points of problem. (including the centre).
- --.tie: Times matrix (minutes).

The instance files are named as primar01, primar02,..., primar42 for "primary", and secon01, 
secon02, ..., secon16 for secundary.
 


These instances have been used in the next works:


J.Pacheco and R. Mart (2006)
"Tabu Search for a Multi-Objective Routing Problem" 
Journal of the Operational Research Society, 57 29-37

A.Corberan, E.Fernndez, M.Laguna and R.Mart (2002)
Heuristic Solutions to the Problem of Routing School Buses with Multiple Objectives
Journal of the Operational Research Society, vol. 53, no. 4, pp. 427-435
 
C.Delgado.  (2002) (Book In spanish)
Nuevas Tcnicas Metaheursticas: Aplicacin al Transporte Escolar
Servicio de Publicaciones de la Universidad de Burgos. ISBN 84-95211-62-9.

C.Delgado y J.Pacheco (2001)
"MinMax vehicle routing problems: application to school transport in the province of Burgos"
Lecture Notes in Economics and Mathematical Systems. Springer, Berlin, n 505, pag. 297-318.
 
J.Pacheco, A.Aragn y Delgado (2000) (In spanish)
"Diseo de Algoritmos para el problema del Transporte Escolar. Aplicacin en la Provincia de Burgos"
Questiio,(now SORT Statistics and Operations Research Transactions) 24, 1, 55-82. 


You can download some of these works in Rafael Marti or Joaqun Pacheco websites.
 


jpacheco@ubu.es
http://www2.ubu.es/econapli/profesores/jpacheco/joaquin_pacheco.htm

rmarti@uv.es
http://www.uv.es/~rmarti/


In excel file "Resultados.xls" are summarized the results corresponding to 16 "secundary" 
instances reported in these works with "minmax" model. 
(That is: to minimize the travel time of the largest (in time) route).

For every instance:

tmax: travel time of largest route used by authorities.
m : number of routes used by authorities
n buses: number of routes (or buses) used by different proposed algorithms

TS1 : Tabu Search algorithm proposed in Delgado (2002) and Delgado and Pacheco (2001)
SS : Scatter Search algorithm proposed in Corberan et al. (2002)
TS2 : Tabu Search-Path Relinking algorithm proposed in Pacheco and Mart (2006)



